Efficiency of Heuristic Algorithms in Solving Waste Collection Vehicle Routing Problem: A Case Study
نویسندگان
چکیده
منابع مشابه
Waste Collection Vehicle Routing Problem Considering Similarity Pattern of Trashcan
Collection of waste is an important logistic activity within any city. In this study, a mathematical model is proposed in order to reduce the cost of waste collection. First a mixed-integer nonlinear programming model is provided including a waste collection routing problem, so that, there is a balance between the distance between trashcans, and the similarity of the trashcans in terms of th...
متن کاملA hybrid metaheuristic algorithm for solving a rollon–rolloff waste collection vehicle routing problem considering waste separation and recycling center
This paper addresses a rollon–rolloff waste collection vehicle routing problem which involves large containers that collect huge amounts of waste from construction sites and shopping malls. In this problem, vehicles could only move one container at a time between customers’ locations, a depot, a disposal center, and a recycling center site. Other than a disposal center, a recycling ...
متن کاملA Heuristic Model for Municipal Solid Waste Collection Vehicle Routing
Appropriate vehicle routing is critical for collecting municipal solid waste (MSW) efficiently. Conventional empirical routing is not easily altered in response to rapidly changing waste management plans and generation. An enhanced model is proposed herein to solve a MSW collection routing problem involving a homogenous fleet. A minimum cost flow method is applied to pre-process the original co...
متن کاملClustering Search Applied to the Periodic Vehicle Routing Problem: a Case Study in Waste Collection
The class of vehicle routing problems (VRP) involves designing the optimal set of routes for fleets of vehicles for the purpose of serving a given set of customers. A variant of the VRP is the Periodic Vehicle Routing Problem (PVRP) that consists in generating a set of routes for each day with minimal global costs and respecting all constraints of the problem. This paper presents a model for th...
متن کاملSolving a bi-objective location routing problem by a NSGA-II combined with clustering approach: application in waste collection problem
It is observed that the separated design of location for depots and routing for servicing customers often reach a suboptimal solution. So, solving location and routing problem simultaneously could achieve better results. In this paper, waste collection problem is considered with regard to economic and societal objective functions. A non-dominated sorting genetic algorithm (NSGA-II) is used to l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Social Sciences Research
سال: 2018
ISSN: 2413-6670,2411-9458
DOI: 10.32861/jssr.spi6.695.700